ILP-based maximum likelihood genome scaffolding

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximum Likelihood Genome Assembly

Whole genome shotgun assembly is the process of taking many short sequenced segments (reads) and reconstructing the genome from which they originated. We demonstrate how the technique of bidirected network flow can be used to explicitly model the double-stranded nature of DNA for genome assembly. By combining an algorithm for the Chinese Postman Problem on bidirected graphs with the constructio...

متن کامل

Constructing a genome assembly that has the maximum likelihood

We formulate genome assembly problem as an optimization problem in which the objective function is the likelihood of the assembly given the reads.

متن کامل

Training Based Maximum Likelihood Channel Identification

In this paper, we address the problem of identifying convolutive channels in a Maximum Likelihood (ML) fashion when a constant training sequences is periodically inserted in the transmitted signal. We consider the case where the channel is quasi-static (i.e. the sampling period is several orders of magnitude below the coherence time of the channel). There are no requirements on the length of th...

متن کامل

Maximum Likelihood Estimation of Feature-Based Distributions

Motivated by recent work in phonotactic learning (Hayes and Wilson 2008, Albright 2009), this paper shows how to define feature-based probability distributions whose parameters can be provably efficiently estimated. The main idea is that these distributions are defined as a product of simpler distributions (cf. Ghahramani and Jordan 1997). One advantage of this framework is it draws attention t...

متن کامل

Maximum Likelihood

In this paper we discuss maximum likelihood estimation when some observations are missing in mixed graphical interaction models assuming a conditional Gaussian distribution as introduced by Lauritzen & Wermuth (1989). For the saturated case ML estimation with missing values via the EM algorithm has been proposed by Little & Schluchter (1985). We expand their results to the special restrictions ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: BMC Bioinformatics

سال: 2014

ISSN: 1471-2105

DOI: 10.1186/1471-2105-15-s9-s9